DECISION BOUNDARY PRESERVING PROTOTYPE SELECTION FOR NEAREST NEIGHBOR CLASSIFICATION
نویسندگان
چکیده
منابع مشابه
Decision boundary preserving prototype selection for nearest neighbor classification
The excessive computational resources required by the Nearest Neighbor rule are a major concern for a number of specialists and practitioners in the Pattern Recognition community. Many proposals for decreasing this computational burden, through reduction of the training sample size, have been published. This paper introduces an algorithm to reduce the training sample size while preserving the o...
متن کاملMerge-Based Prototype Selection for Nearest Neighbor Classification
A generalized prototype-based classification scheme founded on hierarchical clustering is proposed. The basic idea is to obtain a condensed 1-NN classification rule by replacing a group of prototypes by a representative while approximately keeping its original classification abilities. The algorithm improves and generalizes previous works by explicitly introducing the concept of cluster and clu...
متن کاملPROTOTYPE GENERATION FOR NEAREST NEIGHBOR CLASSIFICATION: SURVEY OF METHODS 1 Prototype Generation for Nearest Neighbor Classification: Survey of Methods
Prototype generation techniques have arisen as very competitive methods for enhancing the nearest neighbor classifier through data reduction. A great number of methods tackling the prototype generation problem have been proposed in the literature. This technical report provides a survey of the most representative algorithms developed so far. A previously proposed categorization has been used to...
متن کاملAn Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification
The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...
متن کاملPrivacy Preserving K-nearest Neighbor Classification
This paper considers how to conduct k-nearest neighbor classification in the following scenario: multiple parties, each having a private data set, want to collaboratively build a k-nearest neighbor classifier without disclosing their private data to each other or any other parties. Specifically, the data are vertically partitioned in that all parties have data about all the instances involved, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pattern Recognition and Artificial Intelligence
سال: 2005
ISSN: 0218-0014,1793-6381
DOI: 10.1142/s0218001405004332